Improved Bias Cancellation and Header Communication for Random Gossiping-based Static Wireless Sensor Networks

نویسندگان

  • Zhiliang Chen
  • Alexander Kühne
  • Anja Klein
چکیده

Random gossiping provides a communication paradigm for wireless sensor networks so that all sensors can aggregate messages from the entire network without specifying a routing tree or a central unit. Random gossiping leads to a robust aggregation, however, it also causes biased aggregation and long aggregation time in terms of the number of communications among sensors. In our previous work, a scheme is proposed to reduce and even eliminate the aggregation bias and to reduce the number of communications by introducing indicating headers to the messages that are communicated in the network. In this paper, we extend our work assuming a static wireless sensor network. Exploiting that the topology remains constant in static networks, we introduce an improved bias cancellation method which increases the probability to achieve a bias-free aggregation and an algorithm to reduce the number of communications for indicating headers. Simulation results show the reduction of both the number of communications for indicating headers and the bias in comparison to our previous work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

Multi-hop Coordination in Gossiping-based Wireless Sensor Networks

Gossiping-based wireless sensor networks provide a communication paradigm with which all sensors in the network can aggregate messages from the entire network without specifying a routing tree and a sink sensor. Random gossiping provides a robust aggregation, however, it also leads to biased aggregation and long aggregation time in terms of the number of communications between sensors. In a pre...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

Routing Hole Handling Techniques for Wireless Sensor Networks: A Review

A Wireless Sensor Network consists of several tiny devices which have the capability to sense and compute the environmental phenomenon. These sensor nodes are deployed in remote areas without any physical protections. A Wireless Sensor Network can have various types of anomalies due to some random deployment of nodes, obstruction and physical destructions. These anomalies can diminish the sensi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014